Subsystems of transitive subshifts with linear complexity
نویسندگان
چکیده
Abstract We bound the number of distinct minimal subsystems a given transitive subshift linear complexity, continuing work Ormes and Pavlov [On complexity function for sequences which are not uniformly recurrent. Dynamical Systems Random Processes (Contemporary Mathematics, 736) . American Mathematical Society, Providence, RI, 2019, pp. 125--137]. also generic measures such can support based on its function. Our measure-theoretic bounds generalize those Boshernitzan [A unique ergodicity symbolic flows with block growth. J. Anal. Math. 44 (1) (1984), 77–96] closely related to Cyr Kra [Counting Eur. Soc. 21 (2) (2019), 355–380].
منابع مشابه
Stabilizing Switched Linear Systems With Unstabilizable Subsystems
This paper studies the exponential stabilization problem for discrete-time switched linear systems based on a control-Lyapunov function approach. A number of versions of converse control-Lyapunov function theorems are proved and their connections to the switched LQR problem are derived. It is shown that the system is exponentially stabilizable if and only if there exists a finite integer N such...
متن کاملThe Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations
We study the combinatorial problem which consists, given a system of linear relations, of nding a maximum feasible subsystem, that is a solution satisfying as many relations as possible. The computational complexity of this general problem, named Max FLS, is investigated for the four types of relations =, , > and 6 =. Various constrained versions of Max FLS, where a subset of relations must be ...
متن کاملTournaments with near-linear transitive subsets
Let H be a tournament, and let ≥ 0 be a real number. We call an “Erdős-Hajnal coefficient” for H if there exists c > 0 such that in every tournament G with |V (G)| > 1 not containing H as a subtournament, there is a transitive subset of cardinality at least c|V (G)| . The Erdős-Hajnal conjecture asserts, in one form, that every tournament H has a positive Erdős-Hajnal coefficient. This remains ...
متن کاملThe Complexity of the Topological Conjugacy Problem for Toeplitz Subshifts
In this paper, we analyze the Borel complexity of the topological conjugacy relation on Toeplitz subshifts. More specifically, we prove that topological conjugacy of Toeplitz subshifts with separated holes is hyperfinite. Indeed, we show that the topological conjugacy relation is hyperfinite on a larger class of Toeplitz subshifts which we call Toeplitz subshifts with growing blocks. This resul...
متن کاملComplexity of hybrid logics over transitive frames
This paper examines the complexity of hybrid logics over transitive frames and transitive trees. We show that satisfiability over transitive frames for the hybrid language extended with ↓ is NEXPcomplete. This is in contrast to undecidability of satisfiability over arbitrary frames for this language [2]. We also show that adding @ or the past modality leads to undecidability over transitive fra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2021
ISSN: ['0143-3857', '1469-4417']
DOI: https://doi.org/10.1017/etds.2021.8